Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters

Abstract We investigate the computational complexity of electoral control in elections. Electoral describes scenario where election chair seeks to alter outcome by structural changes such as adding, deleting, or replacing either candidates voters. Such actions have been studied literature for a lot prominent voting rules. complement those results solving several open cases Copeland $$^{\alpha }$$ α , maximin, k -veto, plurality with runoff, veto Condorcet, fallback, range voting, and normalized voting.